On the imaginary parts of chromatic roots

While much attention has been directed to the maximum modulus and maximum real part of chromatic roots of graphs of order $n$ (ie, with $n$ vertices), relatively little is known about the maximum imaginary part of such graphs. We prove that the maximum imaginary part can grow linearly in the order of the graph. We also show that for any fixed $\text{◂+▸}p\in \left(0,1\right)$, almost every random graph $G$ in the Erdös-Rényi model has a nonreal root.     

On constrained Volterra cubic stochastic operators

We consider constrained Volterra cubic stochastic operators and construct several Lyapunov functions for the constrained Volterra cubic stochastic operators. We prove that such kind operators do not have periodic trajectories. Finally, we show that the set of all constrained Volterra cubic stochastic operators is a convex compact set and find the extreme points of this set.     

Iterative process acceleration of calculation of unsteady,viscous, compressible,and heat‐conductive gas flows

In this paper, extrapolation technique is introduced in the Semi‐Implicit Method for Pressure‐Linked Equations ‐ Time Step (SIMPLE‐TS) finite volume iterative algorithm for calculation of compressible Navier–Stokes–Fourier equations subject of slip and jump boundary conditions. The initial state, required by the iterative solver in simulation of unsteady flow problems, is approximated in time by Lagrange polynomial extrapolation in each node. The approach is applicable to a parallel code in a straightforward way due to algorithmic independence of the neighboring nodes in the computational grid. A criterion is proposed to determine the order of extrapolation polynomial and stop the extrapolation execution, when the local steady state is reached. The approach is tested on different microflow problems: Couette flow, flow past a square in a microchannel at subsonic and supersonic speeds, and convective Rayleigh–Bénard flow of a rarefied gas. The acceleration varies from 1.14‐fold to 2.8‐fold. Copyright © 2014 John Wiley & Sons, Ltd.     

On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

The a posteriori error estimates of Chebyshev–Petrov–Galerkin methods for second-order equations

In this paper, the a posteriori error estimates of Chebyshev–Petrov–Galerkin approximations are investigated. For simplicity, we choose the Poisson equation with Dirichlet boundary conditions to discuss the a posteriori error estimators, and deduce their efficient and reliable properties. Some numerical experiments are performed to verify the theoretical analysis for the a posteriori error estimators.     

Kibble–Slepian formula and generating functions for 2D polynomials

We prove a generalization of the Kibble–Slepian formula (for Hermite polynomials) and its unitary analogue involving the 2D Hermite polynomials recently proved in [16]. We derive integral representations for the 2D Hermite polynomials which are of independent interest. Several new generating functions for 2D q-Hermite polynomials will also be given.     

Dimension polynomials of difference local algebras

We extend the concept of the difference dimension polynomial of a difference field extension to difference local algebras. The main theorem of the paper establishes the existence and form of the dimension polynomial associated with the localization of a finitely generated well-mixed difference algebra at a prime reflexive difference ideal.